Packing polyominoes clumsily
نویسندگان
چکیده
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called a clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consists of a single polyomino of a given size and show that one can always construct a periodic packing arbitrarily close in density to the clumsy packing.
منابع مشابه
Clumsy packings with polyominoes
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consist of a single polyomino of a given size and sh...
متن کاملPacking Trominoes is NP-Complete, #P-Complete and ASP-Complete
We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzle...
متن کاملNon-Crystallographic Symmetry in Packing Spaces
In the following, isomorphism of an arbitrary finite group of symmetry, non-crystallographic symmetry (quaternion groups, Pauli matrices groups, and other abstract subgroups), in addition to the permutation group, are considered. Application of finite groups of permutations to the packing space determines space tilings by policubes (polyominoes) and forms a structure. Such an approach establish...
متن کاملExactly solved models of polyominoes and polygons
This chapter deals with the exact enumeration of certain classes of selfavoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of them is a recursive description of the polyominoes which then translates into a functional equation satisfied by the generating function. The first approach a...
متن کاملPolyominoes with Nearly Convex Columns: an Undirected Model
Column-convex polyominoes were introduced in 1950’s by Temperley, a mathematical physicist working on “lattice gases”. By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of column-convex polyominoes. However, the enumeration by area has been done for only one of the said generalizations, namely for multi-directed animals. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 47 شماره
صفحات -
تاریخ انتشار 2014